SUBNANOSECOND ARITHMETIC Second Report

نویسندگان

  • Michael J. Flynn
  • Giovanni De Micheli
  • Robert Dutton
  • R. Fabian Pease
  • Bruce Wooley
چکیده

The Stanford Nanosecond Arithmetic Project is targeted at realizing an arithmetic processor with performance approximately an order of magnitude faster than currently available technology. The realization of SNAP is predicated on an interdisciplinary approach and effort spanning research in algorithms, data representation, CAD, circuits and devices, and packaging. SNAP is visualized as an arithmetic coprocessor implemented on an active substrate containing several chips, each of which realize a particular arithmetic function. This year’s report highlights recent results in the area of wave pipelining. We have fabricated a number of prototype die, implementing a multiplier slice. Cycle times below 5 ns were realized.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The SNAP Project: Towards Sub-Nanosecond Arithmetic

SNAP — the Stanford subnanosecond arithmetic processor — is an interdisciplinary effort to develop theory, tools, and technology for realizing an arithmetic processor with execution rates under 1 ns. Specific improvements in clocking methods, floating-point addition algorithms, floatingpoint multiplication algorithms, division and higher-level function algorithms, design tools, and packaging te...

متن کامل

Laser Damage Study With Subnanosecond Pulses

This report describes a ruby laser test facility for conducting laser-Induced damage experiments with single subnanosecond IISBE. The facility includes a laser damape monitoring system and a mode-locked oscillator-amplifier system with pulse selection.

متن کامل

On Second Geometric-Arithmetic Index of Graphs

The concept of geometric-arithmetic indices (GA) was put forward in chemical graph theory very recently. In spite of this, several works have already appeared dealing with these indices. In this paper we present lower and upper bounds on the second geometric-arithmetic index (GA2) and characterize the extremal graphs. Moreover, we establish Nordhaus-Gaddum-type results for GA2.

متن کامل

The second geometric-arithmetic index for trees and unicyclic graphs

Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...

متن کامل

On Third Geometric-Arithmetic Index of Graphs

Continuing the work K. C. Das, I. Gutman, B. Furtula, On second geometric-arithmetic index of graphs, Iran. J. Math Chem., 1(2) (2010) 17-28, in this paper we present lower and upper bounds on the third geometric-arithmetic index GA3 and characterize the extremal graphs. Moreover, we give Nordhaus-Gaddum-type result for GA3.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991